Deriving Consistent GSM Schemas from DCR Graphs (Full version)

نویسندگان

  • Rik Eshuis
  • Søren Debois
  • Tijs Slaats
  • Thomas Hildebrandt
چکیده

Case Management (CM) is a BPM technology for supporting flexible services orchestration. CM approaches like the OMG standard CMMN and one of its core influences GSM use Event-Condition-Action rules, which can be inconsistent due to cyclic interdependencies between the rules. Repairing an inconsistent case management schema is difficult. To avoid this problem, we provide a technique for automatically deriving consistent GSM case management schemas from higher-level business policies defined as DCR graphs, an alternative CM approach. Concretely, we define a behaviour-preserving mapping that (1) removes the burden from the modeller of GSM schemas to prove consistency and define the ordering of rules, (2) provides high-level patterns for modelling GSM schemas, (3) shows a way to define a notion of progress (liveness) and acceptance for GSM instances. The mapping is illustrated by a running example of a mortgage loan application and a prototype implementation available at http://dcr.itu.dk/icsoc16.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deriving Consistent GSM Schemas from DCR Graphs

Case Management (CM) is a BPM technology for supporting flexible services orchestration. CM approaches like CMMN, an OMG standard, and GSM, one of CMMN’s core influences, use Event-ConditionAction rules, which can be inconsistent due to cyclic inter-dependencies between the rules; repairing such an inconsistent case management schema is difficult. To avoid the problem of inconsistencies altoget...

متن کامل

Contracts for cross-organizational workflows as timed Dynamic Condition Response Graphs

We conservatively extend the declarative Dynamic Condition Response (DCR)Graph process model, introduced in the PhD thesis of the second author, to allowfor discrete time deadlines. We prove that safety and liveness properties can beverified by mapping finite timed DCR Graphs to finite state transition systems.We exemplify how deadlines can introduce time-locks and deadlocks and...

متن کامل

Safety, Liveness and Run-Time Refinement for Modular Process-Aware Information Systems with Dynamic Sub Processes

We study modularity, run-time adaptation and refinement under safety and liveness constraints in event-based process models with dynamic sub-process instantiation. The study is part of a larger programme to provide semantically well-founded technologies for modelling, implementation and verification of flexible, run-time adaptable processaware information systems, moved into practice via the Dy...

متن کامل

Safe Distribution of Declarative Processes

We give a general technique for safe distribution of a declarative (global) process as a network of (local) synchronously communicating declarative processes. Both the global and local processes are given as Dynamic Condition Response (DCR) Graphs. DCR Graphs is a recently introduced declarative process model generalizing labelled prime event structures to a systems model able to finitely repre...

متن کامل

Nested Dynamic Condition Response Graphs

We present an extension of the recently introduced declarative process model Dynamic Condition Response Graphs ( DCR Graphs) to allow nested subgraphs and a new milestone relation between events. The extension was developed during a case study carried out jointly with our industrial partner Exformatics, a danish provider of case and workflow management systems. We formalize the semantics by giv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016